منابع مشابه
The max quasi-independent set Problem
In this paper, we deal with the problem of finding quasi-independent sets in graphs. This problem is formally defined in three versions, which are shown to be polynomially equivalent. The one that looks most general, namely, f -QIS, consists of, given a graph and a non-decreasing function f , finding a maximum size subset Q of the vertices of the graph, such that the number of edges in the indu...
متن کاملThe Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V,E) and present the notion of vertices f -controlled by a subset M ⊆ V . We introduce the generalized maxcontrolled set problem (gmcsp), where gaps and positive weights are associated to each vertex of V . In this case, the objective is find a sandwich graph G in order to maximize the sum of the weights associated to all vertices f -controlled by ...
متن کاملMax Product for Max-Weight Independent Set and Matching
The Max Product (MP) is a local, iterative, message passing style algorithm that has been developed for finding the maximum a posteriori (MAP) assignment of discrete probability distribution specified by a graphical model. The scope of application of MP is vast and in particular it can serve as a heuristic to solve any combinatorial optimization problem. Despite the success of MP algorithm in t...
متن کاملMessage Passing for Max-weight Independent Set
We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of loopy max-product belief propagation. We show that, if it converges, the quality of the estimate is closely related to the tightness of an LP relaxation of the MWIS problem. We use this relationship to obtain sufficient conditions f...
متن کاملExtending the Max Algorithm for maximum independent set
The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set ofG. We also describe two modifications of Algorithm MAX and sets of forbidden indu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2010
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-010-9343-5